Harris hawks optimization: Algorithm and applications

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Artificial Life Optimization Algorithm and Applications

This chapter describes a hybrid artificial life optimization algorithm (ALRT) based on emergent colonization to compute the solutions of global function optimization problem. In the ALRT, the emergent colony is a fundamental mechanism to search the optimum solution and can be accomplished through the metabolism, movement and reproduction among artificial organisms which appear at the optimum lo...

متن کامل

Improvements Based on the Harris Algorithm

Corner detection is a fundamental step in image processing, and it takes an important role in target tracking, image stitching and three-dimension reconstruction. Harris algorithm is widely used in corner detection for simple calculation and its detection result is not affected by image rotation and light intensity changes. Harris algorithm uses integral differential mask to extract the image g...

متن کامل

Genetic Algorithm Applications to Optimization Modeling

Genetic algorithms (GAs) are stochastic search techniques based on the concepts of natural population genetics for exploring a huge solution space in identifying optimal or near optimal solutions (Davis, 1991)(Holland, 1992)(Reeves & Rowe, 2003), and are more likely able to avoid the local optima problem than traditional gradient based hill-climbing optimization techniques when solving complex ...

متن کامل

Chicks, Hawks, and Patriarchal Institutions:

Cooperation occurs only in the shadow of conflict. Conflict lies at the heart of sexual reproduction.

متن کامل

Genetic Algorithm in Search and Optimization: The Technique and Applications

A genetic algorithm (GA) is a search and optimization method developed by mimicking the evolutionary principles and chromosomal processing in natural genetics. A GA begins its search with a random set of solutions usually coded in binary string structures. Every solution is assigned a tness which is directly related to the objective function of the search and optimization problem. Thereafter, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Future Generation Computer Systems

سال: 2019

ISSN: 0167-739X

DOI: 10.1016/j.future.2019.02.028